Some results on the upper bound of optimal values in interval convex quadratic programming
نویسندگان
چکیده
منابع مشابه
Determining the Optimal Value Bounds of the Objective Function in Interval Quadratic Programming Problem with Unrestricted Variables in Sign
In the most real-world applications, the parameters of the problem are not well understood. This is caused the problem data to be uncertain and indicated with intervals. Interval mathematical models include interval linear programming and interval nonlinear programming problems.A model of interval nonlinear programming problems for decision making based on uncertainty is interval quadratic prog...
متن کاملSome Results on the Field of Values of Matrix Polynomials
In this paper, the notions of pseudofield of values and joint pseudofield of values of matrix polynomials are introduced and some of their algebraic and geometrical properties are studied. Moreover, the relationship between the pseudofield of values of a matrix polynomial and the pseudofield of values of its companion linearization is stated, and then some properties of the augmented field of ...
متن کاملA new bound for the quadratic assignment problem based on convex quadratic programming
We describe a new convex quadratic programming bound for the quadratic assignment problem (QAP). The construction of the bound uses a semideenite programming representation of a basic eigenvalue bound for QAP. The new bound dominates the well-known projected eigenvalue bound, and appears to be competitive with existing bounds in the tradeoo between bound quality and computational eeort.
متن کاملSome Results on Convex Spectral Functions: I
In this paper, we give a fundamental convexity preserving for spectral functions. Indeed, we investigate infimal convolution, Moreau envelope and proximal average for convex spectral functions, and show that this properties are inherited from the properties of its corresponding convex function. This results have many applications in Applied Mathematics such as semi-definite programmings and eng...
متن کاملSome Lower-Bound Results on Interval Routing in Planar Graphs
Interval routing is a space-efficient routing method for computer networks. For the method to be practical, the routes it generates must be either shortest paths or not too much longer than the shortest paths. We answer the question ofwhat is the lower bound on the longest path that any interval routing scheme (IRS)may be able to generate for arbitrary planar graphs. In general, theworstcase pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2016
ISSN: 0377-0427
DOI: 10.1016/j.cam.2016.01.044